A Lower Bound on the Transposition Diameter

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Lower Bound on the Transposition Diameter

Sorting permutations by transpositions is an important and difficult problem in genome rearrangements. The transposition diameter TD(n) is the maximum transposition distance among all pairs of permutations in Sn. It was previously conjectured [H. Eriksson et al., Discrete Math., 241 (2001), pp. 289–300] that TD(n) ≤ n+1 2 . This conjecture was disproved by Elias and Hartman [IEEE/ACM Trans. Com...

متن کامل

A Lower Bound on the Reversal and Transposition Diameter

One possible model to study genome evolution is to represent genomes as permutations of genes and compute distances based on the minimum number of certain operations (rearrangements) needed to transform one permutation into another. Under this model, the shorter the distance, the closer the genomes are. Two operations that have been extensively studied are the reversal and the transposition. A ...

متن کامل

A Lower Bound on the Diameter of the Flip Graph

The flip graph is the graph whose nodes correspond to non-isomorphic combinatorial triangulations and whose edges connect pairs of triangulations that can be obtained one from the other by flipping a single edge. In this note we show that the diameter of the flip graph is at least

متن کامل

A Diameter Bound For

By Margulis’ result, in our setting diameter and injectivty radius are inversely related. Thus, our theorem can also be viewed as a lower bound on injectivity radius; that is, with the above hypothesis, inj(M) > 1 R(l(P )) . It is known that that infinitely many closed, hyperbolic 3-manifolds of volume less than a given upper bound may be obtained by hyperbolic Dehn surgery on a finite list of ...

متن کامل

A lower bound on IMMSE �

This paper provides upper and lower bounds on the information rates achievable with a minimum mean square error (MMSE) Tomlinson-Harashima precoder (THP) assuming ideal interleaving. We also give an exact formula for zero-forcing (ZF) THP achievable information rates. At high SNR, the performance of the MMSE-THP and the ZF-THP identically suuer only the 2.55 bit or 1.53 dB \shaping" loss from c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2010

ISSN: 0895-4801,1095-7146

DOI: 10.1137/080741860